Proof by induction using test sets
Identifieur interne : 00E830 ( Main/Exploration ); précédent : 00E829; suivant : 00E831Proof by induction using test sets
Auteurs : Deepak Kapur [États-Unis] ; Paliath Narendran [États-Unis] ; Hantao Zhang [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: A new method for proving an equational formula by induction is presented. This method is based on the use of the Knuth-Bendix completion procedure for equational theories, and it does not suffer from limitations imposed by the inductionless induction methods proposed by Musser and Huet and Hullot. The method has been implemented in RRL, a Rewrite Rule Laboratory. Based on extensive experiments, the method appears to be more practical and efficient than a recently proposed method by Jouannaud and Kounalis. Using ideas developed for this method, it is also possible to check for sufficient completeness of equational axiomatizations.
Url:
DOI: 10.1007/3-540-16780-3_83
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000977
- to stream Istex, to step Curation: 000971
- to stream Istex, to step Checkpoint: 003616
- to stream Main, to step Merge: 00F118
- to stream Main, to step Curation: 00E830
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Proof by induction using test sets</title><author><name sortKey="Kapur, Deepak" sort="Kapur, Deepak" uniqKey="Kapur D" first="Deepak" last="Kapur">Deepak Kapur</name></author><author><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name></author><author><name sortKey="Zhang, Hantao" sort="Zhang, Hantao" uniqKey="Zhang H" first="Hantao" last="Zhang">Hantao Zhang</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:2A1F8BA2AA43E0882B7271942BBA67A18D703EC4</idno><date when="1986" year="1986">1986</date><idno type="doi">10.1007/3-540-16780-3_83</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-ZK0RVG5N-H/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000977</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000977</idno><idno type="wicri:Area/Istex/Curation">000971</idno><idno type="wicri:Area/Istex/Checkpoint">003616</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">003616</idno><idno type="wicri:doubleKey">0302-9743:1986:Kapur D:proof:by:induction</idno><idno type="wicri:Area/Main/Merge">00F118</idno><idno type="wicri:Area/Main/Curation">00E830</idno><idno type="wicri:Area/Main/Exploration">00E830</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Proof by induction using test sets</title><author><name sortKey="Kapur, Deepak" sort="Kapur, Deepak" uniqKey="Kapur D" first="Deepak" last="Kapur">Deepak Kapur</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Corporate Research & Development, General Electric Co., Schenectady, NY</wicri:regionArea><placeName><region type="state">État de New York</region></placeName></affiliation></author><author><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Corporate Research & Development, General Electric Co., Schenectady, NY</wicri:regionArea><placeName><region type="state">État de New York</region></placeName></affiliation></author><author><name sortKey="Zhang, Hantao" sort="Zhang, Hantao" uniqKey="Zhang H" first="Hantao" last="Zhang">Hantao Zhang</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Dept. of Computer Science, Rensselaer Polytechnic Institute, Troy, NY</wicri:regionArea><placeName><region type="state">État de New York</region></placeName></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: A new method for proving an equational formula by induction is presented. This method is based on the use of the Knuth-Bendix completion procedure for equational theories, and it does not suffer from limitations imposed by the inductionless induction methods proposed by Musser and Huet and Hullot. The method has been implemented in RRL, a Rewrite Rule Laboratory. Based on extensive experiments, the method appears to be more practical and efficient than a recently proposed method by Jouannaud and Kounalis. Using ideas developed for this method, it is also possible to check for sufficient completeness of equational axiomatizations.</div></front></TEI><affiliations><list><country><li>États-Unis</li></country><region><li>État de New York</li></region></list><tree><country name="États-Unis"><region name="État de New York"><name sortKey="Kapur, Deepak" sort="Kapur, Deepak" uniqKey="Kapur D" first="Deepak" last="Kapur">Deepak Kapur</name></region><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name><name sortKey="Zhang, Hantao" sort="Zhang, Hantao" uniqKey="Zhang H" first="Hantao" last="Zhang">Hantao Zhang</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00E830 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00E830 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:2A1F8BA2AA43E0882B7271942BBA67A18D703EC4
|texte= Proof by induction using test sets
}}
| This area was generated with Dilib version V0.6.33. |  |